package com.cloud.code.leetcode;

/**
 *53. 最大子数组和
 */
public class Demo6 {

    public int maxSubArray(int[] nums) {

        int[] dp = new int[nums.length+5];
        dp[0] = nums[0];

        int max = dp[0];
        for (int i = 1; i < nums.length; i++) {
            dp[i] = Math.max(nums[i],dp[i-1]+nums[i]);

            max = Math.max(max,dp[i]);
        }

        return max;

    }
}
